Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

基于贝叶斯模型的装备剩余寿命预测研究

为了解决武器装备日益复杂及维修工作日趋繁重的问题,运用贝叶斯模型预测装备修理后的剩余寿命,为合理安排其修理计划提供依据。替代传统的指数分布,用威布尔分布描述系统寿命特征,并运用极大似然方法和贝叶斯方法估计威布尔分布的两个未知参数,给出其置信区间。在此基础上,对先验样本和后验样本两种不同情况,分别运用贝叶斯模型预测装备修理后的剩余寿命,并给出实例。结果表明了该方法的有效性。     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

Hopfield神经网络的防空火力最优分配问题

火力的最优分配是作战计划的重要内容,它包含火力单位特性、目标单位特性、最优准则、射击条件四个方面的内容。简要介绍了Hopfield神经网络的基础知识,建立了防空自动化指挥系统中火力分配的Hopfield神经网络算法一般模型,在此基础上,阐述了利用该算法在火力分配中的一般应用,并通过在计算机上借助C语言编程实现了这一模型,得出了一种比较合理可行的火力分配方案。     

基于模糊聚类分析在炮兵战场目标打击排序中的应用

炮兵战场上经侦察得到的目标情况往往比较复杂,利用模糊聚类分析法确定目标区域内各种目标的先后打击次序,建立模糊相似关系矩阵,最后在给定阈值的基础上计算出目标的优先打击次序,为战场指挥员提供比较合理的火力分配,从而最大限度地发挥炮兵火力效能。     

基于Wigner-Ville时频幅值曲率的结构位置损伤识别

为探索既有明确物理意义又有良好实用性的结构损伤识别方法,利用Wigner-Ville时频分布（WVD）对结构自由振动响应进行解析,建立了WVD时频幅值与结构模态参数的函数关系,提出利用测点WVD时频幅值曲率来识别损伤。该方法物理意义明确,初始激励易于实施,且不需要模态参数识别,提高了损伤识别精度。算例分析结果表明,所提出的方法能较好地识别出结构单个或多个损伤位置,且数据易于获得,处理简便。     

基于模糊匈牙利算法的炮兵火力单位分配问题

发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题.     

飞航导弹故障飞行落点概率计算方法

针对飞航导弹故障飞行落点概率难以准确计算的问题,通过分析导弹的各个分系统的故障机理重新提出五种故障模式,依据逐系统串联的原理建立了故障模式的概率分配计算模型;在对发射、飞行和故障后坠落等阶段进行分析的基础上建立各故障模式的仿真模型;最后应用蒙特卡洛方法对某型导弹故障飞行落点的概率分布进行了仿真计算。     

装备使用阶段后续备件采购模型Π:可修复件

针对装备使用阶段可修复件的采购优化问题,引入近似拉普拉斯需求概率分布代替正态分布,建立了采购间隔期内的备件短缺函数。根据供应链系统库存控制论,建立了可修备件的采购模型。通过对可修件周转渠道的分析,对采购短缺指标进行了修订,并给出了最优采购点和采购量的计算方法。对两种需求分布下的算例结果进行了对比和分析,结果表明:该模型得到的结果鲁棒性强、偏差小,优化过程简单,为故障率高、消耗量低的可修件采购方案的确定提供了一种新的思路。     

考虑火药中钝感剂含量分布的内弹道计算

针对某新型弹药弹道性能检测的需要,利用气相色谱法对其发射药中钝感剂含量分布进行了测定,建立了考虑钝感剂含量分布的该新型火炮的内弹道模型。模型中钝感剂对弹道性能的影响是通过对火药燃速和火药力的影响来体现的。应用该模型对2个批次的弹药进行了内弹道计算,并对一定樟脑含量的火药内弹道性能进行了预测。计算结果表明,樟脑含量对最大膛压影响较大,但对初速的影响则不如膛压明显。